Comparison of Moving Least Squares and RBF+poly for Interpolation and Derivative Approximation
نویسندگان
چکیده
منابع مشابه
Moving Least Squares Approximation
An alternative to radial basis function interpolation and approximation is the so-called moving least squares method. As we will see below, in this method the approximation Pf to f is obtained by solving many (small) linear systems, instead of via solution of a single – but large – linear system as we did in the previous chapters. To make a connection with the previous chapters we start with th...
متن کاملRecent Results for Moving Least Squares Approximation
We describe two experiments recently conducted with the approximate moving least squares (MLS) approximation method. On the one hand, the NFFT library of Kunis, Potts, and Steidl is coupled with the approximate MLS method to obtain a fast and accurate multivariate approximation method. The second experiment uses approximate MLS approximation in combination with a multilevel approximation algori...
متن کاملThe approximation power of moving least-squares
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented by the Backus-Gilbert approach. It is shown that the method works very well for interpolation, smoothing and derivatives’ approximations. For the interpolation problem this approach gives Mclain’s method. The method ...
متن کاملIterated Approximate Moving Least Squares Approximation
The radial basis function interpolant is known to be the best approximation to a set of scattered data when the error is measured in the native space norm. The approximate moving least squares method, on the other hand, was recently proposed as an efficient approximation method that avoids the solution of the system of linear equations associated with the radial basis function interpolant. In t...
متن کاملMoving Least Squares Multiresolution Surface Approximation
We describe a new method for surface reconstruction based on unorganized point clouds without normals. We also present a new algorithm for refining the inital triangulation. The output of the method is a refined triangular mesh with points on the moving least squares surface of the original point cloud.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2019
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-019-01028-8